On formal and automatic security verification of WSN transport protocols
نویسندگان
چکیده
In this paper, we address the problem of formal and automated security verification ofWSN transport protocols that may perform cryptographic operations. The verification ofthis class of protocols is difficult because they typically consist of complex behavioral charac-teristics, such as real-time, probabilistic, and cryptographic operations. To solve this problem,we propose a probabilistic timed calculus for cryptographic protocols, and demonstrate howto use this formal language for proving security or vulnerability of protocols. The main ad-vantage of the proposed language is that it supports an expressive syntax and semantics,including bisimilarities that supports real-time, probabilistic, and cryptographic issues at thesame time. Hence, it can be used to verify the systems that involve these three properties in amore convenient way. In addition, we propose an automatic verification method, based on thewell-known PAT process analysis toolkit, for this class of protocols. For demonstration pur-poses, we apply the proposed manual and automatic proof methods for verifying the securityof DTSN and SDTP, which are two of the recently proposed WSN tranport protocols.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملA Formal Verification Centred Development Process for Security Protocols
This chapter concerns the correct and reliable design of modern security protocols. It discusses the importance of formal verification of security protocols prior to their release by publication or implementation. A discussion on logic-based verification of security protocols and its automation provides the reader with an overview of the current state-of-the-art of formal verification of securi...
متن کاملFormal Verification of Improved Numeric Comparison Protocol for Secure Simple Paring in Bluetooth Using ProVerif
Recently, research has been conducted on automatic verification of cryptographic security protocols with the formal method. An automatic verifier is very useful because the risk of human error in such complicated protocols can be reduced. In this paper, we introduce our formalization of an improved Numeric Comparison protocol for Secure Simple Pairing in Bluetooth proposed by Yeh et al. and ver...
متن کاملAnBx: Automatic Generation and Verification of Security Protocols Implementations
The AnBx compiler is a tool for automatic generation of Java implementations of security protocols specified in a simple and abstract model that can be formally verified. In our model-driven development approach, protocols are described in AnBx , an extension of the Alice & Bob notation. Along with the synthesis of consistency checks, the tool analyses the security goals and produces annotation...
متن کاملAutomatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus
Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance have been proposed in the literatures, but these formal models are not supported by automatic tools. Recently Backes et al. propose a new formal automated model of security properties including soundness and coercionresis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013